On the Addition of Residue Classes Modp By

نویسنده

  • H. Heilbronn
چکیده

In this paper we investigate the following question. Let p be a prime, a,, " ', cck distinct non-zero residue classes modp, N a residue class modp. denote Dhe number of solutions of the congruence ela,+... + ekak = N(modp) where the e,,. .. , ek are restricted to the values 0 and 1, What can be said about the function J?(N)? We prove two theorems. THEOREM I. 14 " (X) > 0 if k > 3 (6;~) " ~. THEOREM II. P(N) = 2kp-'(1+o(1)) $ k3pS2-+ 00 as p + co. Theorem I is almost best possible. Put al = ', '2 =-1, a3 = 2, a4 =-2,. .. . ckk = (Lx)k-'[&(k+l)]. Then it follows from an easy calc.ulation that F(S(p-1)) = 0 if k < 2 (p1/2-1). Theorem II is best possible. Define CZ~,. .. , ak as above and assume that p2f3 < k = O(P'/~), Then it follows from our analysis that limp2-kp(0) > 1. p-too In the method of proof the two theorems differ considerably. The proof of Theorem I is elementary, depending entirely on the manipulation of residue classes mBdp, whereas the proof of Theorem II is based on the application of finite Fourier series and simple considerations on diophantine approximations. In an appendix we state various further conjectures which we are not able to prove.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on Mod and Generalised Mod Classes

We characterise Mod classes in terms of #P functions, where the membership is determined by co-primality or gcd testing of the function value (Theorem 3.1), instead of residue (mod k) testing. Imposing a restriction on the range of the functions gives a characterisation of the intersection of Mod classes (Theorem 3.2). These intersection classes, which we denote by Mod ∩k P , are interesting be...

متن کامل

Distribution of Special Sequences modulo a Large Prime

As it was indicated in [5], A. Odlyzko asks for which values of N the set A contains all residue classes (modp). The conjecture is that one can take N to be as small as p1/2+ε, for any positive ε and p > c with some c = c(ε). From the result of Rudnick and Zaharescu [4] it follows that in Odlyzko’s problem one can take N = c0p logp for some absolute constant c0. One of the main results of [5] i...

متن کامل

Residuacity of Primes

Let q,p be distinct primes with p — ef + 1. A variant of the Kummer-Dedekind theorem is proved for Gaussian periods, which shows in particular that q is an e-th power (modp) if and only if the Gaussian period polynomial of degree e has e (not necessarily distinct) linear factors (modg). This is applied to give a simple criterion in terms of the parameters in the partitions p = 8 / + 1 = X 2 + Y...

متن کامل

Overflow Detection in Residue Number System, Moduli Set {2n-1,2n,2n+1}

Residue Number System (RNS) is a non-weighted number system for integer number arithmetic, which is based on the residues of a number to a certain set of numbers called module set. The main characteristics and advantage of residue number system is reducing carry propagation in calculations. The elimination of carry propagation leads to the possibility of maximizing parallel processing and reduc...

متن کامل

On the locality of arb-invariant first-order logic with modulo counting quantifiers

We study Gaifman and Hanf locality of an extension of first-order logic with modulo p counting quantifiers (FO+MODp, for short) with arbitrary numerical predicates. We require that the validity of formulas is independent of the particular interpretation of the numerical predicates and refer to such formulas as arb-invariant formulas. This paper gives a detailed picture of locality and non-local...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1964